Random dilutions, generating functions, and the void probability distribution function
نویسندگان
چکیده
منابع مشابه
Random dilutions , generating functions , and the
The generating function for counts in randomly placed cells is derived using the characteristic functional. The distribution of voids in a randomly diluted subset of a given point distribution is shown to contain information about all the other count probabilities. Thus, random dilutions may be used to derive the entire distribution function from the void distribution. A generalization of the r...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملProbability generating functions of absolute difference of two random variables.
Communicated by Jerzy Neyman, August 1, 1966 1. All random variables considered in this note are nonnegative and integervalued. Generically, the probability generating functions (P. G. F.) of such variables are denoted by G with subscripts identifying the random variables concerned. The argument, or arguments of the P. G. F., denoted by either u or v, will be assumed to have their moduli less t...
متن کاملProbability Generating Functions for Discrete Real Valued Random Variables
The probability generating function is a powerful technique for studying the law of finite sums of independent discrete random variables taking integer positive values. For real valued discrete random variables, the well known elementary theory of Dirichlet series and the symbolic computation packages available nowadays, such as Mathematica 5 TM, allows us to extend to general discrete random v...
متن کاملChoice probability generating functions
This paper establishes that every random utility discrete choice model (RUM) has a representation that can be characterized by a choice-probability generating function (CPGF) with speci c properties, and that every function with these speci c properties is consistent with a RUM. The choice probabilities from the RUM are obtained from the gradient of the CPGF. Mixtures of RUM are characterized b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 1996
ISSN: 0035-8711,1365-2966
DOI: 10.1093/mnras/278.1.101